Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
نویسنده
چکیده
Finite automata are being used to encode images. Applications of this technique include image compression, and extraction of self similarity information and Hausdorr dimension of the encoded image. J urgensen and Staiger 6] proposed a method by which the local Haus-dorr dimension of the encoded image could be eeectively computed. This paper describes the rst implementation of this procedure and presents some experimental results showing local entropy maps computed from images represented by nite automata.
منابع مشابه
Automatic Face Recognition via Local Directional Patterns
Automatic facial recognition has many potential applications in different areas of humancomputer interaction. However, they are not yet fully realized due to the lack of an effectivefacial feature descriptor. In this paper, we present a new appearance based feature descriptor,the local directional pattern (LDP), to represent facial geometry and analyze its performance inrecognition. An LDP feat...
متن کاملOn the Suitability of Hausdorff Dimension as a measure of Texture Complexity
It has been suggested that the Hausdorff dimension of an image texture would be a good measure of the texture’s complexity. Binary images can be generated by Büchi automata over a four-letter alphabet. The entropy of the ω-language accepted by such a Büchi automaton has been shown to coincide with the Hausdorff (fractal) dimension of the ωlanguage if the language is finite-state and closed. Jür...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملKullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
We consider the problem of computing the Kullback-Leibler distance, also called the relative entropy, between a probabilistic context-free grammar and a probabilistic finite automaton. We show that there is a closed-form (analytical) solution for one part of the Kullback-Leibler distance, viz. the cross-entropy. We discuss several applications of the result to the problem of distributional appr...
متن کاملComplexity of a Problem Concerning Reset Words for Eulerian Binary Automata
A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given maximum length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets, as it has been conjectured by Martyu...
متن کامل